Formally self-dual additive codes over F4 and near-extremal self-dual codes

نویسنده

  • Sunghyu Han
چکیده

We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a better minimum distance than any self-dual additive (7, 27) codes over F4. We further define near-extremal formally selfdual additive codes over F4 as an analogue of near-extremal binary formally self-dual codes, and prove that they do not exist if their lengths are n = 16, 18 or n ≥ 20. We improve the bounds on the minimum distance of formally self-dual binary codes in a similar manner. Finally, we extend S. Zhang’s best known upper bound on the highest minimum distance of the four types of classical self-dual codes of large lengths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formally self-dual additive codes over F4

We introduce a class of formally self-dual additive codes over F4 as a natural analogue of binary formally self-dual codes, which is missing in the study of additive codes over F4. We define extremal formally self-dual additive codes over F4 and classify all such codes. Interestingly, we find exactly three formally self-dual additive (7, 27) odd codes over F4 with minimum distance d = 4, a bett...

متن کامل

The nonexistence of near-extremal formally self-dual codes

A code C is called formally self-dual if C and C⊥ have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over F2, F3, and F4. These codes are called extremal if their minimum distances achieve the MallowsSloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally se...

متن کامل

New extremal binary self-dual codes from F4+uF4-lifts of quadratic circulant codes over F4

In this work, quadratic double and quadratic bordered double circulant constructions are applied to F4 + uF4 as well as F4, as a result of which extremal binary self-dual codes of length 56 and 64 are obtained. The binary extension theorems as well as the ring extension version are used to obtain 7 extremal self-dual binary codes of length 58, 24 extremal self-dual binary codes of length 66 and...

متن کامل

Upper Bounds for the length of s - Extremal Codes over F 2 , F 4 , and F 2 + u F 2

Our purpose is to find an upper bound for the length of s-extremal codes over F2 (resp. F4) when d ≡ 2 (mod 4) (resp. d odd). This question is left open in [6], [2]. More precisely, we show that there is no s-extremal binary code of length n ≥ 21d− 82 if d > 6 and d ≡ 2 (mod 4). Similarly we show that there is no s-extremal additive F4 code of length n ≥ 13d− 26 if d > 1 and d is odd. We also d...

متن کامل

Directed graph representation of half-rate additive codes over GF(4)

Abstract. We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation reduces the complexity of code classification, and enables us to classify additive (n, 2n) codes over GF(4) of length up to 7. From this we also derive classifications ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007